Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
نویسندگان
چکیده
منابع مشابه
Counting Lattice Points in Polytopes via Riemann-Roch
This paper is a partial summary of the survey paper [1]. In particular, we are interested in telling the following story: given a lattice polytope, P , one would like to find an efficient way of counting the lattice points contained in P . One of the nicest ways to accomplish this is to use algebraic geometry in a clever and beautiful way. Namely, from P one can construct a toric variety, XP , ...
متن کاملUniversal Counting of Lattice Points in Polytopes
Given a lattice polytope P (with underlying lattice L), the universal counting function UP (L ) = |P ∩ L| is defined on all lattices L containing L. Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation UP = UQ. Mathematics Subject Classification: 52B20, 52A27, 11P21 Partially supported by Hungarian Science Foundation Grant T 016391, and by the Fr...
متن کاملNumerical contour integration for loop integrals
A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and efficient numerical integrations an along appropriate contour can be performed for tensor integrals as well as for scalar ones appearing in loop calculation...
متن کاملOn Counting Integral Points in a Convex Rational Polytope
Given a convex rational polytope b = x ∈ n+ Ax= b , we consider the function b → f b , which counts the nonnegative integral points of b . A closed form expression of its -transform z → z is easily obtained so that f b can be computed as the inverse -transform of . We then provide two variants of an inversion algorithm. As a by-product, one of the algorithms provides the Ehrhart polynomial of a...
متن کاملPoints in Two Polytopes
We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2020
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2019.0997